CDMTCS Research Report Series Synchronization in P Modules

In the field of molecular computing, in particular P systems, synchronization is an essential requirement for composing or sequentially linking together congenial P system activities. We provide an improved deterministic algorithm based on static structures and traditional rules, which runs in 4e + 13 steps, where e is the eccentricity of the initiating cell. Using the same model, extended with the support of cell IDs, we provide another deterministic algorithm, which runs in 3e+13 steps. Our algorithms use a convenient framework, called P modules, which embraces the essential features of many popular types of P systems.